Minimum-latency transport protocols with modulo-N incarnation numbers
نویسندگان
چکیده
منابع مشابه
Euler Numbers modulo 2
Let {En} be the Euler numbers. In the paper we give a general congruence modulo 2(m+2)n involving for Eb and for E2mk+b, where k, m, n are positive integers and b ∈ {0, 2, 4, . . .}. MSC: Primary 11B68, Secondary 11A07
متن کاملMultiple Product Modulo Arbitrary Numbers
Let n binary numbers of length n be given. The Boolean function ``Multiple Product'' MPn asks for (some binary representation of ) the value of their product. It has been shown (K.-Y. Siu and V. Roychowdhury, On optimal depth threshold circuits for multiplication and related problems, SIAM J. Discrete Math. 7, 285 292 (1994)) that this function can be computed in polynomial-size threshold circu...
متن کاملCatalan Numbers Modulo 2 k
In this paper, we develop a systematic tool to calculate the congruences of some combinatorial numbers involving n!. Using this tool, we re-prove Kummer’s and Lucas’ theorems in a unique concept, and classify the congruences of the Catalan numbers cn (mod 64). To achieve the second goal, cn (mod 8) and cn (mod 16) are also classified. Through the approach of these three congruence problems, we ...
متن کاملLatency Insensitive Protocols
The theory of latency insensitive design is presented as the foundation of a new correct by construction methodology to design very large digital systems by assembling blocks of Intellectual Properties. Latency insensitive designs are synchronous distributed systems and are realized by assembling functional modules exchanging data on communication channels according to an appropriate protocol. ...
متن کاملA Classification of Motzkin Numbers Modulo 8
The well-known Motzkin numbers were conjectured by Deutsch and Sagan to be nonzero modulo 8. The conjecture was first proved by Sen-Peng Eu, Shu-chung Liu and Yeong-Nan Yeh by using the factorial representation of the Catalan numbers. We present a short proof by finding a recursive formula for Motzkin numbers modulo 8. Moreover, such a recursion leads to a full classification of Motzkin numbers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 1995
ISSN: 1063-6692
DOI: 10.1109/90.392385